翻訳と辞書 Words near each other ・ Graph manifold ・ Graph minor ・ Graph Modelling Language ・ Graph Nobel ・ Graph of a function ・ Graph of desire ・ Graph of groups ・ Graph operations ・ Graph paper ・ Graph partition ・ Graph pax ・ Graph pebbling ・ Graph power ・ Graph product ・ Graph property ・ Graph realization problem ・ Graph reduction ・ Graph reduction machine ・ Graph rewriting ・ Graph sandwich problem ・ Graph state ・ Graph structure theorem ・ Graph Style Sheets ・ Graph theory ・ Graph theory in enzymatic kinetics ・ Graph toughness ・ Graph traversal ・ Graph-based access control ・ GRaPH-Int ・ Graph-structured stack Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Graph realization problem ： ウィキペディア英語版 Graph realization problem The graph realization problem is a decision problem in graph theory. Given a finite sequence $(d\_1,\backslash dots,d\_n)$ of natural numbers, the problem asks whether there is labeled simple graph such that $(d\_1,\backslash dots,d\_n)$ is the degree sequence of this graph. ==Solutions== The problem can be solved in polynomial time. One method of showing this uses the Havel–Hakimi algorithm constructing a special solution with the use of a recursive algorithm.〔.〕〔.〕 Alternatively, following the characterization given by the Erdős–Gallai theorem, the problem can be solved by testing the validity of $n$ inequalities.〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Graph realization problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.